An interval extension based on occurrence grouping

An Interval Extension Based on Occurrence Grouping: Method and Properties

In interval arithmetics, special care has been brought to the definition of interval extension functions that compute narrow interval images. In particular, when a function f is monotonic w.r.t. a variable in a given domain, it is well-known that the monotonicity-based interval extension of f computes a sharper (interval) image than the natural interval extension does. This paper presents a so-...

A New Monotonicity-Based Interval Extension Using Occurrence Grouping

When a function f is monotonic w.r.t. a variable in a given domain, it is well-known that the monotonicity-based interval extension of f computes a sharper image than the natural interval extension does. This paper presents a so-called “occurrence grouping” interval extension [f ]og of a function f . f is not monotonic w.r.t. a variable x in the given domain [B], but we transform f into a new f...

A note on "An interval type-2 fuzzy extension of the TOPSIS method using alpha cuts"

The technique for order of preference by similarity to ideal solution (TOPSIS) is a method based on the ideal solutions in which the most desirable alternative should have the shortest distance from positive ideal solution and the longest distance from negative ideal solution. Depending on type of evaluations or method of ranking, different approaches have been proposing to calculate distances ...

Cross-Efficiency Evaluation Based on an Interval Method

Precoloring extension on unit interval graphs

In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [6], we show that the precoloring extension problem is NP-complete on unit interval graphs.